Brief Announcement: Optimal Bit-Reversal Using Vector Permutations
نویسندگان
چکیده
We have developed a bit-reversal algorithm (BRAVO) using vector permute operations, which is optimal in the number of permutations, and its cache-optimal version (COBRAVO). Our implementation on PowerMac G5 shows 2– 4.5 fold improvement for small data sets and 15–75% improvement for large data sets (depending on the data element size) over the best known approach (COBRA).
منابع مشابه
On the limits of cache-oblivious rational permutations
Permuting a vector is a fundamental primitive which arises in many applications. In particular, rational permutations, which are defined by permutations of the bits of the binary representations of the vector indices, are widely used. Matrix transposition and bit-reversal are notable examples of rational permutations. In this paper we contribute a number of results regarding the execution of th...
متن کاملVirtual Memory for Data-Parallel Computing
This thesis explores several issues that arise in the design and implementation of virtual-memory systems for data-parallel computing. Chapter 1 presents an overview of virtual memory for data-parallel computing. The chapter lists some applications that may benefit from large address spaces in a data-parallel model. It also describes the view of virtual memory for data-parallel computing used i...
متن کاملBPC Permutations on the OTIS-Hypercube Optoelectronic Computer
We show that the diameter of an N 2 processor OTIS-Hypercube computer (N = 2 d) is 2d + 1. OTIS-Hypercube algorithms for some commonly performed permutations { transpose, bit reversal, vector reversal, perfect shuue, unshuue, shuued row-major, and bit shuue { are developed. We also propose an algorithm for general BPC permutations.
متن کاملIndex Transformation Algorithms in a Linear Algebra Framework
We present a linear algebraic formulation for a class of index transformations such as Gray code encoding and decoding, matrix transpose, bit reversal, vector reversal, shuues, and other index or dimension permutations. This formulation uniies, simpliies, and can be used to derive algorithms for hypercube multiprocessors. We show how all the widely known properties of Gray codes and some not so...
متن کاملD 6 . 10 Fast Bit - Reversal Algorithms
Several numerical computations, including the Fast Fourier Transform 0, require that the data is ordered according to a bit-reversed permutation. In fact, for several standard FIT programs, this pre or post computation is claimed to take 10-50 percent of the computation time [l]. In this paper, a linear sequential bit-reversal algorithm is presented. This is an improvement by a factor of logzn ...
متن کامل